Eigenvector Centrality: Illustrations Supporting the Utility of Extracting More Than One Eigenvector to Obtain Additional Insights into Networks and Interdependent Structures
نویسندگان
چکیده
Among the many centrality indices used to detect structures of actors’ positions in networks is the use of the first eigenvector of an adjacency matrix that captures the connections among the actors. This research considers the seeming pervasive current practice of using only the first eigenvector. It is shows that, as in other statistical applications of eigenvectors, subsequent vectors can also contain illuminating information. Several small examples, and Freeman’s EIES network, are used to illustrate that while the first eigenvector is certainly informative, the second (and subsequent) eigenvector(s) can also be equally tractable and informative.
منابع مشابه
Measuring Centrality and Power Recursively in the World City Network: A Reply to Neal
In a recent article, Zachary Neal (2011) distinguishes between centrality and power in world city networks and proposes two measures of recursive power and centrality. His effort to clarify oversimplistic interpretations of relational measures of power and position in world city networks is appreciated. However, Neal’s effort to innovate methodologically is based on theoretical reasoning that i...
متن کاملLobby index as a network centrality measure
We study the lobby index ( l for short) as a local node centrality measure for complex networks. The l is compared with degree (a local measure), betweenness and Eigenvector centralities (two global measures) in the case of a biological network (Yeast interaction protein-protein network) and a linguistic network (Moby Thesaurus II ). In both networks, the l has poor correlation with betweenness...
متن کاملA General Framework of Studying Eigenvector Multicentrality in Multilayer Networks
Multilayer networks have drawn much attention in the community of network science recently. Tremendous effort has been invested to understand their structure and functions, among which centrality is one of the most effective approaches. While various metrics of centrality have been proposed for single-layer networks, a general framework of studying centrality in multiplayer networks is lacking....
متن کاملEigenvector-Based Centrality Measures for Temporal Networks
Numerous centrality measures have been developed to quantify the importances of nodes in time-independent networks, and many of them can be expressed as the leading eigenvector of some matrix. With the increasing availability of network data that changes in time, it is important to extend such eigenvector-based centrality measures to time-dependent networks. In this paper, we introduce a princi...
متن کاملCorrelation of Eigenvector Centrality to Other Centrality Measures: Random, Small-world and Real-world Networks
In this paper, we thoroughly investigate correlations of eigenvector centrality to five centrality measures, including degree centrality, betweenness centrality, clustering coefficient centrality, closeness centrality, and farness centrality, of various types of network (random network, smallworld network, and real-world network). For each network, we compute those six centrality measures, from...
متن کامل